Execution of NVRAM Programs with Persistent Stack
نویسندگان
چکیده
Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits traditional persistent memory (persistency data over failures) and DRAM (fast random access). In this work, we describe an algorithm can be used to execute NVRAM programs recover system after failure while taking architecture real-world systems into account. Moreover, NVRAM-destined on commodity hardware, such as hard drives. That allows us test algorithms using only cheap without having access NVRAM. We report usage our implement CAS algorithm.
منابع مشابه
Reverse Stack Execution
Introducing variability during program execution is an effective technique for fighting software monoculture which enables the quick spread of malicious code such as viruses and worms. Existing works in the area of automatic generation of execution variability have been limited to instruction randomization and heap allocation randomization, even though stack overflows are the predominant attack...
متن کاملA Tool for Visualizing the Execution of Programs and Stack Traces Especially Suited for Novice Programmers
Software engineering education and training has obstacles caused by a lack of basic knowledge about a process of program execution. The article is devoted to the development of special tools that help to visualize the process. We analyze existing tools and propose a new approach to stack and heap visualization. The solution is able to overcome major drawbacks of existing tools and suites well f...
متن کاملReverse Stack Execution in a Multi-Variant Execution Environment
Multi-variant execution allows detecting exploited vulnerabilities before they can cause any damage to systems. In this execution method, two or more slightly different variants of the same application are executed simultaneously on top of a monitoring layer. In the course of execution, the monitoring layer checks whether the instances are always in complying states. Any discrepancies raises an...
متن کاملTuning Fuzzy Logic Programs with Symbolic Execution
Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well as the most appropriate fuzzy connectives and operators. In this paper, we introduce a symbolic extension of fuzzy logic programs in which some of these para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86359-3_9